A generic interval branch and bound algorithm for parameter estimation
نویسندگان
چکیده
منابع مشابه
An Interval Branch and Bound Algorithm for Parameter Estimation
The parameter estimation problem is a widespread and challenging problem in engineering sciences consisting in computing the parameters of a parametric model that fit observed data. The computer vision community has proposed the RANSAC algorithm to deal with outliers in the observed data. This randomized algorithm is efficient but non-deterministic and therefore incomplete. Jaulin et al. propos...
متن کاملA modified branch and bound algorithm for a vague flow-shop scheduling problem
Uncertainty plays a significant role in modeling and optimization of real world systems. Among uncertain approaches, fuzziness describes impreciseness while for ambiguity another definition is required. Vagueness is a probabilistic model of uncertainty being helpful to include ambiguity into modeling different processes especially in industrial systems. In this paper, a vague set based on dista...
متن کاملAn interval-matrix branch-and-bound algorithm for bounding eigenvalues
We present and explore the behaviour of a branch-and-bound algorithm for calculating valid bounds on the k-th largest eigenvalue of a symmetric interval matrix. Branching on the interval elements of the matrix takes place in conjunction with the application of Rohn’s method (an interval extension of Weyl’s theorem) in order to obtain valid outer bounds on the eigenvalues. Inner bounds are obtai...
متن کاملAn interval branch and bound algorithm for bound constrained optimization problems
In this paper, we propose modiications to a prototypical branch and bound algorithm for nonlinear optimization so that the algorithm eeciently handles constrained problems with constant bound constraints. The modiications involve treating subregions of the boundary identically to interior regions during the branch and bound process, but using reduced gradients for the interval Newton method. Th...
متن کاملA branch and bound algorithm for the robust shortest path problem with interval data
Many real problems in transportation and telecommunications can be modelled in mathematical terms as shortest path problems on interval digraphs, where an interval of costs is associated with each arc. Intervals represent uncertainty, typical of real situations, about the exact values of costs. In this context, a robust shortest path is a path which is ideally not too far from the best one, wha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Global Optimization
سال: 2018
ISSN: 0925-5001,1573-2916
DOI: 10.1007/s10898-018-0721-3